package demo2;

//牛客网:数位染色
//https://www.nowcoder.com/practice/adf828f399de4932955734a4eac12757?tpId=230&tqId=38956&ru=/exam/oj

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        char[] ch = scanner.next().toCharArray();
        int n = ch.length;
        int sum = 0;
        for(int i = 0; i<n; i++) {
            sum += (ch[i]-'0');
        }
        if(sum % 2 == 1) {
            System.out.println("No");
            return;
        }
        int m = sum/2;
        boolean[][] dp = new boolean[n+1][m+1];
        dp[0][0] = true;
        for(int i = 1; i<=n; i++) {
            for(int j = 1; j<=m; j++) {
                int x = ch[i-1] - '0';
                dp[i][j] = dp[i-1][j]; //不选
                if(j-x >=0 && dp[i-1][j-x]) {
                    dp[i][j] = dp[i-1][j-x]; //选
                }
            }
        }
        if(dp[n][m]) {
            System.out.println("Yes");
        }else {
            System.out.println("No");
        }
    }
}


/*

dp[i][j] : 从前i个数中选的数之和能否构成j

 */

